Parallel Feedback Turing Computability
نویسنده
چکیده
In contrast to most kinds of computability studied in mathematical logic, feedback computability has a non-degenerate notion of parallelism. Here we study parallelism for the most basic kind of feedback, namely that of Turing computability. We investigate several different possible definitions of parallelism in this context, with an eye toward specifying what is so computable. For the deterministic notions of parallelism identified we are successful in this analysis; for the non-deterministic notion, not
منابع مشابه
Feedback computability on Cantor space
We introduce the notion of feedback computable functions from 2 to 2, extending feedback Turing computation in analogy with the standard notion of computability for functions from 2 to 2. We then show that the feedback computable functions are precisely the effectively Borel functions. With this as motivation we define the notion of a feedback computable function on a structure, independent of ...
متن کاملOn the computability of graph Turing machines
We consider graph Turing machines, a model of parallel computation on a graph, in which each vertex is only capable of performing one of a finite number of operations. This model of computation is a natural generalization of several well-studied notions of computation, including ordinary Turing machines, cellular automata, and parallel graph dynamical systems. We analyze the power of computatio...
متن کاملChurch's Thesis and the Conceptual Analysis of Computability
Church’s thesis asserts that a number-theoretic function is intuitively computable if and only if it is recursive. A related thesis asserts that Turing’s work yields a conceptual analysis of the intuitive notion of numerical computability. I endorse Church’s thesis, but I argue against the related thesis. I argue that purported conceptual analyses based upon Turing’s work involve a subtle but p...
متن کاملThe Interplay Between Computability and Incomputability Draft 619.tex
1 Calculus, Continuity, and Computability 3 1.1 When to Introduce Relative Computability? . . . . . . . . . . 4 1.2 Between Computability and Relative Computability? . . . . . 5 1.3 The Development of Relative Computability . . . . . . . . . . 5 1.4 Turing Introduces Relative Computability . . . . . . . . . . . 6 1.5 Post Develops Relative Computability . . . . . . . . . . . . . 6 1.6 Relative ...
متن کاملDefinability and global degree theory
Gödel’s work [Gö34] on undecidable theories and the subsequent formalisations of the notion of a recursive function ([Tu36], [Kl36] etc.) have led to an ever deepening understanding of the nature of the non-computable universe (which as Gödel himself showed, includes sets and functions of everyday significance). The nontrivial aspect of Church’s Thesis (any function not contained within one of ...
متن کامل